Check-hybrid GLDPC codes: Systematic elimination of trapping sets and guaranteed error correction capability
نویسندگان
چکیده
In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CHGLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set into super checks corresponding to a 2-error correcting component code. Specifically, we follow two main purposes to construct the check-hybrid codes; first, based on the knowledge of the trapping sets of the global LDPC code, single parity checks are replaced by super checks to disable the trapping sets. We show that by converting specified single check nodes, denoted as critical checks, to super checks in a trapping set, the parallel bit flipping (PBF) decoder corrects the errors on a trapping set and hence eliminates the trapping set. The second purpose is to minimize the rate loss caused by replacing the super checks through finding the minimum number of such critical checks. We also present an algorithm to find critical checks in a trapping set of column-weight 3 LDPC code and then provide upper bounds on the minimum number of such critical checks such that the decoder corrects all error patterns on elementary trapping sets. Moreover, we provide a fixed set for a class of constructed check-hybrid codes. The guaranteed error correction capability of the CH-GLDPC codes is also studied. We show that a CH-GLDPC code in which each variable node is connected to 2 super checks corresponding to a 2-error correcting component code corrects up to 5 errors. The results are also extended to column-weight 4 LDPC codes. Finally, we investigate the eliminating of trapping sets of a column-weight 3 LDPC code using the Gallager B decoding algorithm and generalize the results obtained for the PBF for the Gallager B decoding algorithm. Index Terms Check-hybrid GLDPC codes, Critical set, Error correction capability, Gallager B decoding algorithm, Low-density paritycheck (LDPC) codes, Parallel bit flipping (PBF) algorithm, Splitting number, Trapping set.
منابع مشابه
Codes on Graphs and Analysis of Iterative Algorithms for Reconstructing Sparse Signals and Decoding of Check-Hybrid GLDPC Codes
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1. Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 1.1. Block Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 1.1.1. Linear Block Codes . . . . . . . . . . . . . . . . . . 22 1.2. Commun...
متن کاملDesign and optimization of AL-FEC codes: the GLDPC-Staircase codes. (Conception et optimisation de codes AL-FEC : les codes GLDPC- Staircase)
This work is dedicated to the design, analysis and optimization of Application-Level Forward Erasure Correction (AL-FEC) codes. In particular, we explore a class of Generalized LDPC (GLDPC) codes, named GLDPC-Staircase codes, involving the LDPCStaircase code (base code) as well as Reed-Solomon (RS) codes (outer codes). In the first part of this thesis, we start by showing that RS codes having “...
متن کاملError Correction Capability of Column-Weight-Three LDPC Codes
In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct k ≥ 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this result, we show that given any α > 0,∃N such that ∀n > N , no code in the ensemble of column-weight...
متن کاملAn FPGA Design of Generalized Low-density Parity-check Codes for Rate-adaptive Optical Transport Networks
Forward error correction (FEC) is as one of the key technologies enabling the next-generation high-speed fiber optical communications. In this paper, we propose a rate-adaptive scheme using a class of generalized low-density parity-check (GLDPC) codes with a Hamming code as local code. We show that with the proposed unified GLDPC decoder architecture, a variable net coding gains (NCGs) can be a...
متن کاملMultilevel generalised low-density parity-check codes
Introduction: Multilevel coding (MLC) was proposed by Imai and Hirawaki [1] as a bandwidth-efficient coded modulation scheme designed for protecting each bit of a non-binary symbol with the aid of binary codes, while maintaining different target bit error rates (BERs). Parallel independent decoding (PID) [2] is employed as an efficient decoding strategy with reduced decoding delay, where there ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Trans. Emerging Telecommunications Technologies
دوره 27 شماره
صفحات -
تاریخ انتشار 2016